On Computing the Hamming Distance
نویسندگان
چکیده
Methods for the fast computation of Hamming distance developed for the case of large number of pairs of words are presented and discussed in the paper. The connection of this subject to some questions about intersecting sets and Hadamard designs is also considered.
منابع مشابه
Inverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance
Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملThe Intractability of Computing the Hamming Distance
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogously defined. First, we prove that there is a language in AC such that both Hamming and edit distance to this language are hard to approximate; they cannot be approximated with factor O(n 1 3 − ), for any > 0, unless P =...
متن کاملThe Intractability of Computingthe Hamming
Given a language L, the Hamming distance of a string x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a given language is deened similarly. First, we prove that the Hamming distance to languages in AC 0 is hard to approximate; it cannot be approximated within a factor O ? n 1 3 ? , for any > 0, unless P = NP (n denotes the length of the input stri...
متن کاملThe Communication Complexity of Gap Hamming Distance
In the gap Hamming distance problem, two parties must determine whether their respective strings x; y 2 f0; 1g are at Hamming distance less than n=2 p n or greater than n=2 C p n: In a recent tour de force, Chakrabarti and Regev (STOC ’11) proved the long-conjectured ̋.n/ bound on the randomized communication complexity of this problem. In follow-up work several months ago, Vidick (2010; ECCC T...
متن کاملComputer Arithmetic Preserving Hamming Distance of Operands in Operation Result
The traditional approach to fault tolerant computing involves replicating computation units and applying a majority vote operation on individual result bits. This approach, however, has several limitations; the most severe is the resource requirement. This paper presents a new method for fault tolerant computing where for a given error rate, , the hamming distance between correct inputs and fau...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Acta Cybern.
دوره 16 شماره
صفحات -
تاریخ انتشار 2004